Matrix Subspaces of L 1 ∗

نویسنده

  • Gideon Schechtman
چکیده

If E = {ei} and F = {fi} are two 1-unconditional basic sequences in L1 with E r-concave and F p-convex, for some 1 ≤ r < p ≤ 2, then the space of matrices {ai,j} with norm ∥{ai,j}∥E(F ) = ∥∥∑ k ∥ ∑ l ak,lfl∥ek ∥∥ embeds into L1. This generalizes a recent result of Prochno and Schütt.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On reducing and deflating subspaces of matrices

A multilinear approach based on Grassmann representatives and matrix compounds is presented for the identification of reducing pairs of subspaces that are common to two or more matrices. Similar methods are employed to characterize the deflating pairs of subspaces for a regular matrix pencil A+ sB, namely, pairs of subspaces (L,M) such that AL ⊆ M and BL ⊆ M.

متن کامل

Symplectic subspaces of symplectic Grassmannians

Let V be a non-degenerate symplectic space of dimension 2n over the field F and for a natural number l < n denote by Cl(V ) the incidence geometry whose points are the totally isotropic l-dimensional subspaces of V . Two points U, W of Cl (V ) will be collinear when W ⊂ U⊥ and dim(U ∩ W ) = l − 1 and then the line on U and W will consist of all the l-dimensional subspaces of U + W which contain...

متن کامل

On reducibility of weighted composition operators

In this paper, we study two types of the reducing subspaces for the weighted composition operator $W: frightarrow ucdot fcirc varphi$ on $L^2(Sigma)$. A necessary and sufficient condition is given for $W$ to possess the reducing subspaces of the form $L^2(Sigma_B)$ where $Bin Sigma_{sigma(u)}$. Moreover, we pose some necessary and some sufficient conditions under which the subspaces of the form...

متن کامل

THE ELEMENTARY DIVISORS OF THE INCIDENCE MATRICES OF POINTS AND LINEAR SUBSPACES IN P(Fp)

The elementary divisors of the incidence matrices between points and linear subspaces of fixed dimension in Pn(Fp) are computed. Introduction Let V be an (n+ 1)-dimensional vector space over Fp. Let Lr denote the set of r-dimensional subspaces of V . Then L1 is the set of points of the projective space P(V ) and Ln the set of hyperplanes. The group G = GL(V ) acts transitively on each of the se...

متن کامل

Supplementary Material of Noise-Tolerant Life-Long Matrix Completion via Adaptive Sampling

We compare the sample complexity of Algorithm 2 (Single Subspace) and Algorithm 3 (Mixture of Subspaces) for the exact recovery of the underlying matrix. The data are generated as follows. We construct 5 independent subspaces {Si}i=1 whose bases {Ui}i=1 are 100× 4 random matrices consisting of orthogonal columns (τ = 4 and r = 20). We then sample 20 data from each subspace uniformly and obtain ...

متن کامل

On the Sequential and Random Selection of Subspaces over a Finite Field

Let V, be an n-dimensional vector space over GF(q), and let 0 < k < n. We consider the question of generating sets of basis vectors for k-dimensional subspaces V, of V, in two ways: (a) the sequential generation of a set of basis vectors for every such subspace and (b) the random selection of such a subspace V, in such a way that all subspaces have equal a priori probabilities of being chosen. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013